A constrained edit distance algorithm between semi-ordered trees
نویسندگان
چکیده
منابع مشابه
A constrained edit distance algorithm between semi-ordered trees
In this paper, we propose a formal definition of a new class of trees called semiordered trees and a polynomial dynamic programming algorithm to compute a constrained edit distance between such trees. The core of the method relies on a similar approach to compare unordered (K. Zhang, 1996, Algorithmica, 15:205-222) and ordered trees (K. Zhang, 1995, Pattern recognition, 28(3):463-474). The meth...
متن کاملA new constrained edit distance between quotiented ordered trees
In this paper we propose a dynamic programming algorithm to compare two quotiented ordered trees using a constrained edit distance. An ordered tree is a tree in which the left-to-right order among siblings is significant. A quotiented ordered tree is an ordered tree T with an equivalence relation on vertices and such that, when the equivalence classes are collapsed to super-nodes, the graph so ...
متن کاملEdit distance between unlabeled ordered trees
There exists a bijection between one stack sortable permutations –permutations which avoid the pattern 231– and planar trees. We define an edit distance between permutations which is coherent with the standard edit distance between trees. This one-to-one correspondence yields a polynomial algorithm for the subpermutation problem for (231) avoiding permutations. Moreover, we obtain the generatin...
متن کاملA Linear Tree Edit Distance Algorithm for Similar Ordered Trees
We describe a linear algorithm for comparing two similar ordered rooted trees with node labels. The method for comparing trees is the usual tree edit distance. We show that an optimal mapping which uses at most k insertions or deletions can then be constructed in O(nk) where n is the size of the trees. The approach is inspired by the ZhangShasha algorithm for tree edit distance in combination w...
متن کاملComputing the Edit-Distance between Unrooted Ordered Trees
An ordered tree is a tree in which each node’s incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The edit distance between A and B is the minimum cost of a sequence of operations (contract an edge, uncontract an edge, modify the label of an edge) needed to transform A into B. We give an O(n logn) algorithm to compute the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.11.022